Papers with ranking method
Dialogue Response Ranking Training with Large-Scale Human Feedback Data (2020.emnlp-main)
Copied to clipboard
| Challenge: | Existing open-domain dialog models can minimize the perplexity of target human responses . however, some human responses are more engaging than others, spawning more followup interactions . |
| Approach: | They train open-domain dialog models to minimize perplexity of target human responses . they use social media feedback data to train models to predict engaging dialog turns . |
| Outcome: | The proposed model outperforms existing models on 133M human feedback pairs . it also outperformed the conventional dialog perplexity baseline model . |
Simple Question Answering with Subgraph Ranking and Joint-Scoring (N19-1)
Copied to clipboard
| Challenge: | Knowledge graph based simple question answering is a major area of research in question answering. |
| Approach: | They propose a framework to describe and analyze existing knowledge graph based simple question answering approaches. |
| Outcome: | The proposed model achieves a state-of-the-art (85.44% accuracy) on the SimpleQuestions dataset. |
Automated Few-Shot Classification with Instruction-Finetuned Language Models (2023.findings-emnlp)
Copied to clipboard
| Challenge: | Existing few-shot learning approaches combine language models with prompts, but they often require domain knowledge and substantial guesswork. |
| Approach: | They propose a method to eliminate the need for handcrafted prompts by generating two distinct, semantically meaningful class descriptions and a selection mechanism via cross-validation. |
| Outcome: | The proposed method outperforms state-of-the-art few-shot learning methods over 12 datasets, spanning 8 classification tasks. |
Learning to Stop in Structured Prediction for Neural Machine Translation (N19-1)
Copied to clipboard
| Challenge: | Beam search optimization solves many problems in neural machine translation, but lacks principled stopping criteria and does not learn how to stop during training. |
| Approach: | They propose a ranking method which enables an optimal beam search stop-ping criteria and a structured prediction loss function which penalizes suboptimal finished candidates produced by beam search during training. |
| Outcome: | Experiments on synthetic and real languages show that the proposed methods improve translation quality and length. |
RankNAS: Efficient Neural Architecture Search by Pairwise Ranking (2021.emnlp-main)
Copied to clipboard
| Challenge: | Existing methods require training millions of architectures to estimate the accuracy of the search results. |
| Approach: | They propose a performance ranking method (RankNAS) that uses pairwise ranking and search space pruning to enlarge the search space. |
| Outcome: | The proposed method significantly accelerates NAS through pairwise ranking and search space pruning. |